On Quantum Algorithms for Noncommutative Hidden Subgroups

نویسندگان

  • Mark Ettinger
  • Peter Høyer
چکیده

Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. We present a quantum algorithm for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function. We also explore the difficulties of developing an algorithm to process the data to explicitly calculate a generating set for the subgroup. A general framework for the noncommutative hidden subgroup problem is discussed and we indicate future research directions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of additive functional equation on discrete quantum semigroups

We construct  a noncommutative analog of additive functional equations on discrete quantum semigroups and show that this noncommutative functional equation has Hyers-Ulam stability on amenable discrete quantum semigroups. The discrete quantum semigroups that we consider in this paper are in the sense of van Daele, and the amenability is in the sense of Bèdos-Murphy-Tuset. Our main result genera...

متن کامل

Limitations of single coset states and quantum algorithms for code equivalence

Quantum computers can break the RSA, El Gamal, and elliptic curve public-key cryptosystems, as they can efficiently factor integers and extract discrete logarithms. The power of such quantum attacks lies in quantum Fourier sampling, an algorithmic paradigm based on generating and measuring coset states. In this article we extend previous negative results of quantum Fourier sampling for Graph Is...

متن کامل

ar X iv : q ua nt - p h / 02 11 09 1 v 1 1 5 N ov 2 00 2 Hidden Translation and Orbit Coset in Quantum Computing ∗

We give efficient quantum algorithms for HIDDEN TRANSLATION and HIDDEN SUBGROUP in a large class of non-abelian groups including solvable groups of bounded exponent and of bounded derived series. Our algorithms are recursive. For the base case, we solve efficiently HIDDEN TRANSLATION in Z p , whenever p is a fixed prime. For the induction step, we introduce the problem ORBIT COSET generalizing ...

متن کامل

On some possible mathematical connections concerning Noncommutative Minisuperspace Cosmology, Noncommutative Quantum Cosmology in low-energy String Action, Noncommutative Kantowsky-Sachs Quantum Model, Spectral Action Principle associated with a Noncommutative Space and some aspects concerning the Loop Quantum Gravity

This paper is a review of some interesting results that has been obtained in various sectors of noncommutative cosmology, string theory and loop quantum gravity. In the Section 1, we have described some results concerning the noncommutative model of the closed Universe with the scalar field. In the Section 2, we have described some results concerning the low-energy string effective quantum cosm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999